class Solution 
{
public:
    int maxArea(vector<int>& height) 
    {
        int left = 0, right = height.size() - 1, max_v = 0;
        while(left < right)
        {
            int v = min(height[left], height[right]) * (right - left);
            
            max_v = max(max_v, v);

            if(height[left] < height[right]) ++left;
            else --right;
        }

        return max_v;
    }
};